The Monoid Rank and Monoid Presentation of Order-Preserving and Order-Decreasing Full Contraction Mappings

نویسندگان

چکیده

Let $n \in \mathbb{Z}^{+}$ and $X_{n}=\{1,2,\ldots,n\}$ be a finite set. $\mathcal ODCT_{n}$ the order-preserving order-decreasing full contraction mappings on $X_{n}$. It is well known that monoid. In this paper, we have found monoid rank presentation of ODCT_{n}$. particular, proved $n-1$ for $$ \geq 3$.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Monoid for the Grassmannian Bruhat Order

Structure constants for the multiplication of Schubert polynomials by Schur symmetric polynomials are related to the enumeration of chains in a new partial order on S 1 , the Grassmaniann Bruhat order. Here we present a monoid M related to this order. We develop a notion of reduced sequences for M and show that M is analogous to the nil-Coxeter monoid for the weak order on S 1 .

متن کامل

asymptotic property of order statistics and sample quntile

چکیده: فرض کنید که تابعی از اپسیلون یک مجموع نامتناهی از احتمالات موزون مربوط به مجموع های جزئی براساس یک دنباله از متغیرهای تصادفی مستقل و همتوزیع باشد، و همچنین فرض کنید توابعی مانند g و h وجود دارند که هرگاه امید ریاضی توان دوم x متناهی و امیدریاضی x صفر باشد، در این صورت می توان حد حاصلضرب این توابع را بصورت تابعی از امید ریاضی توان دوم x نوشت. حالت عکس نیز برقرار است. همچنین ما با استفاده...

15 صفحه اول

Generating the Full Transformation Semigroup Using Order Preserving Mappings

For a linearly ordered set X we consider the relative rank of the semigroup of all order preserving mappingsOX on X modulo the full transformation semigroup TX . In other words, we ask what is the smallest cardinality of a set A of mappings such that 〈OX ∪A 〉 = TX . When X is countably infinite or well-ordered (of arbitrary cardinality) we show that this number is one, while when X = R (the set...

متن کامل

Largest subsemigroups of the full transformation monoid

In this paper we are concerned with the following question: for a semigroup S, what is the largest size of a subsemigroup T ≤ S where T has a given property? The semigroups S that we consider are the full transformation semigroups; all mappings from a finite set to itself under composition of mappings. The subsemigroups T that we consider are of one of the following types: left zero, right zero...

متن کامل

A MONOID FOR THE UNIVERSAL k-BRUHAT ORDER

Structure constants for the multiplication of Schubert polynomials by Schur symmetric polynomials are known to be related to the enumeration of chains in a new partial order on S∞, the universal k-Bruhat order. Here we present a monoid M for this order. We show that M is analogous to the nil-Coxeter monoid for the weak order on S∞. For this, we develop the theory of reduced sequences for M. We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical sciences and applications e-notes

سال: 2021

ISSN: ['2147-6268']

DOI: https://doi.org/10.36753/mathenot.807993